%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SET045^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 02:58:34 EDT 2022

% Result   : Theorem 0.09s 0.31s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  10 unt;   4 typ;   0 def)
%            Number of atoms       :   26 (  16 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   16 (   4   ~;   0   |;   0   &;  12   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Number of types       :    2 (   2 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^   8   !;   4   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_a,type,
    a: $tType ).

thf(tp_b,type,
    b: $tType ).

thf(tp_cA,type,
    cA: b ).

thf(tp_sK1_V,type,
    sK1_V: ( a > b ) > a ).

thf(1,conjecture,
    ? [U: a > b] :
    ! [V: a] :
      ( ( U @ V )
      = cA ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTTTP5243) ).

thf(2,negated_conjecture,
    ( ( ? [U: a > b] :
        ! [V: a] :
          ( ( U @ V )
          = cA ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [U: a > b] :
        ! [V: a] :
          ( ( U @ V )
          = cA ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ~ ? [U: a > b] :
          ! [V: a] :
            ( ( U @ V )
            = cA ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [U: a > b] :
          ( ( U @ ( sK1_V @ U ) )
         != cA ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [U: a > b] :
          ( ( U @ ( sK1_V @ U ) )
         != cA ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ! [SV1: a > b] :
      ( ( ( ( SV1 @ ( sK1_V @ SV1 ) )
         != cA ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[6]) ).

thf(8,plain,
    ! [SV1: a > b] :
      ( ( ( SV1 @ ( sK1_V @ SV1 ) )
        = cA )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

thf(9,plain,
    $false = $true,
    inference(extuni,[status(esa)],[8:[bind(SV1,$thf( ^ [SX0: a] : cA ))]]) ).

thf(10,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem  : SET045^5 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.09  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.09/0.28  % Computer : n020.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Sun Jul 10 13:54:13 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.09/0.29  
% 0.09/0.29   No.of.Axioms: 0
% 0.09/0.29  
% 0.09/0.29   Length.of.Defs: 0
% 0.09/0.29  
% 0.09/0.29   Contains.Choice.Funs: false
% 0.09/0.29  (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.09/0.31  ********************************
% 0.09/0.31  *   All subproblems solved!    *
% 0.09/0.31  ********************************
% 0.09/0.31  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:9,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.31  
% 0.09/0.31  %**** Beginning of derivation protocol ****
% 0.09/0.31  % SZS output start CNFRefutation
% See solution above
% 0.09/0.31  
% 0.09/0.31  %**** End of derivation protocol ****
% 0.09/0.31  %**** no. of clauses in derivation: 10 ****
% 0.09/0.31  %**** clause counter: 9 ****
% 0.09/0.31  
% 0.09/0.31  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:9,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------